Computing group cardinality constraint solutions for logistic regression problems
نویسندگان
چکیده
منابع مشابه
Solving Logistic Regression with Group Cardinality Constraints for Time Series Analysis
We propose an algorithm to distinguish 3D+t images of healthy from diseased subjects by solving logistic regression based on cardinality constrained, group sparsity. This method reduces the risk of overfitting by providing an elegant solution to identifying anatomical regions most impacted by disease. It also ensures that consistent identification across the time series by grouping each image f...
متن کاملGroup Orthogonal Matching Pursuit for Logistic Regression
We consider a matching pursuit approach for variable selection and estimation in logistic regression models. Specifically, we propose Logistic Group Orthogonal Matching Pursuit (LogitGOMP), which extends the Group-OMP procedure originally proposed for linear regression models, to select groups of variables in logistic regression models, given a predefined grouping structure within the explanato...
متن کاملThe group lasso for logistic regression
The group lasso is an extension of the lasso to do variable selection on (predefined) groups of variables in linear regression models. The estimates have the attractive property of being invariant under groupwise orthogonal reparameterizations. We extend the group lasso to logistic regression models and present an efficient algorithm, that is especially suitable for high dimensional problems, w...
متن کاملSample size determination for logistic regression
The problem of sample size estimation is important in medical applications, especially in cases of expensive measurements of immune biomarkers. This paper describes the problem of logistic regression analysis with the sample size determination algorithms, namely the methods of univariate statistics, logistics regression, cross-validation and Bayesian inference. The authors, treating the regr...
متن کاملStable Solutions for Dynamic Constraint Satisfaction Problems
An important extension of constraint technology involves problems that undergo changes that may invalidate the current solution. Previous work on dynamic problems sought methods for eeciently nding new solutions. We take a more proactive approach, exploring methods for nding solutions more likely to remain valid after changes that temporarily alter the set of valid assignments (stable solutions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Medical Image Analysis
سال: 2017
ISSN: 1361-8415
DOI: 10.1016/j.media.2016.05.011